Mobile and Wireless Technologies 2017 by Kuinam J. Kim & Nikolai Joukov

Author:Kuinam J. Kim & Nikolai Joukov
Language: eng
Format: epub
Publisher: Springer Singapore, Singapore

Fig. 5.Relationship between cache count and delete count in each algorithms

Meanwhile, ERF shows intermediate form compared to LFU and LRU as shown in Fig. 5. The form of graph in ERF looks optimal, but it also needs certain level of protection to last accessed items due to their low cache count.

As shown in Table 2, bringing out two eviction processes outperform LRU and LFU. In this context, Overtime is a simple eviction process which evicts objects which were not requested for a certain time . Also, eviction operations are applied evenly to all objects regardless of cache counts as shown in Fig. 6. As request counts increases, the gap between delete count of conventional algorithms and our approach increases. As a result, high hit ratio derives the decrease of the copy and the delete operations of thumbnail cache. It also drives improvement of the response time to clients’ requests.Table 2.The results of each algorithms

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.